Hierarchical synopses with optimal error guarantees
نویسندگان
چکیده
منابع مشابه
Constructing Optimal Wavelet Synopses
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, with accuracy guarantees, answers. In this work we present a generic formulation for the problem of constructing optimal wavelet synopses under space constraints for various error metrics, both for static and streaming d...
متن کاملCompressed Sensing with Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time
A compressed sensing method consists of a rectangular measurement matrix, M ∈ R m×N with m ≪ N , together with an associated recovery algorithm, A : R → R . Compressed sensing methods aim to construct a high quality approximation to any given input vector x ∈ R using onlyMx ∈ R as input. In particular, we focus herein on instance optimal nonlinear approximation error bounds for M and A of the f...
متن کاملOptimal Histograms with Quality Guarantees
Histograms are commonly used to capture attribute value distribution statistics for query optimizers. More recently, histograms have also been considered as a way to produce quick approximate answers to decision support queries. This widespread interest in histograms motivates the problem of computing his-tograms that are good under a given error metric. In particular, we are interested in an e...
متن کاملOn Randomly Projected Hierarchical Clustering with Guarantees
1 Hierarchical clustering (HC) algorithms are generally limited to small data instances due to their runtime costs. Here we mitigate this shortcoming and explore fast HC algorithms based on random projections for single (SLC) and average (ALC) linkage clustering as well as for the minimum spanning tree problem (MST). We present a thorough adaptive analysis of our algorithms that improve prior w...
متن کاملHierarchical Motion Planning with Kinodynamic Feasibility Guarantees
Motion planning for mobile vehicles involves the solution of two disparate sub-problems: the satisfaction of highlevel logical task specifications and the design of low-level vehicle control laws. A hierarchical solution of these two sub-problems is efficient, but may not ensure compatibility between the highlevel planner and the dynamic constraints of the vehicle. To guarantee such compatibili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2008
ISSN: 0362-5915,1557-4644
DOI: 10.1145/1386118.1386124